On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
общая лексика
видоизменять команду
общая лексика
команда перехода
машинная команда или оператор языка программирования, позволяющий изменить порядок выполнения команд или операторов программы
вычислительная техника
команда ветвления
общая лексика
условный переход
оператор языка программирования или машинная команда, которая заставляет процессор перейти на другое место программы и продолжить её выполнение с него, если в результате предыдущих операций выполнилось заданное в операторе (в команде) условие
синоним
In computer science, read–modify–write is a class of atomic operations (such as test-and-set, fetch-and-add, and compare-and-swap) that both read a memory location and write a new value into it simultaneously, either with a completely new value or some function of the previous value. These operations prevent race conditions in multi-threaded applications. Typically they are used to implement mutexes or semaphores. These atomic operations are also heavily used in non-blocking synchronization.
Maurice Herlihy (1991) ranks atomic operations by their consensus numbers, as follows:
It is impossible to implement an operation that requires a given consensus number with only operations with a lower consensus number, no matter how many of such operations one uses. Read–modify–write instructions often produce unexpected results when used on I/O devices, as a write operation may not affect the same internal register that would be accessed in a read operation.
This term is also associated with RAID levels that perform actual write operations as atomic read–modify–write sequences. Such RAID levels include RAID 4, RAID 5 and RAID 6.